Symmetry Reductions of a Hamilton-Jacobi-Bellman Equation Arising in Financial Mathematics
نویسنده
چکیده
We determine the solutions of a nonlinear Hamilton-Jacobi-Bellman equation which arises in the modelling of mean-variance hedging subject to a terminal condition. Firstly we establish those forms of the equation which admit the maximal number of Lie point symmetries and then examine each in turn. We show that the Lie method is only suitable for an equation of maximal symmetry. We indicate the applicability of the method to cases in which the parametric function depends also upon the time.
منابع مشابه
Optimal control of stochastic delayed systems with jumps
We consider the optimal control of stochastic delayed systems with jumps, in which both the state and controls can depend on the past history of the system, for a value function which depends on the initial path of the process. We derive the Hamilton-Jacobi-Bellman equation and the associated verification theorem and prove a necessary and a sufficient maximum principles for such problems. Expli...
متن کاملA Transformation Method for Solving the Hamilton{--}jacobi{--}bellman Equation for a Constrained Dynamic Stochastic Optimal Allocation Problem
We propose and analyse a method based on the Riccati transformation for solving the evolutionary Hamilton–Jacobi–Bellman equation arising from the dynamic stochastic optimal allocation problem. We show how the fully nonlinear Hamilton–Jacobi– Bellman equation can be transformed into a quasilinear parabolic equation whose diffusion function is obtained as the value function of a certain parametr...
متن کاملCombined Fixed Point and Policy Iteration for Hamilton-Jacobi-Bellman Equations in Finance
Implicit methods for Hamilton–Jacobi–Bellman (HJB) partial differential equations give rise to highly nonlinear discretized algebraic equations. The classic policy iteration approach may not be efficient in many circumstances. In this article, we derive sufficient conditions to ensure convergence of a combined fixed point policy iteration scheme for the solution of discretized equations. Numeri...
متن کاملDynamic Programming for Stochastic Target Problems and Geometric Flows
Given a controlled stochastic process, the reachability set is the collection of all initial data from which the state process can be driven into a target set at a specified time. Differential properties of these sets are studied by the dynamic programming principle which is proved by the Jankov-von Neumann measurable selection theorem. This principle implies that the reachability sets satisfy ...
متن کاملOptimal Trading with Stochastic Liquidity and Volatility
We consider the problem of mean-variance optimal agency execution strategies, when the market liquidity and volatility vary randomly in time. Under specific assumptions for the stochastic processes satisfied by these parameters, we construct a Hamilton–Jacobi–Bellman equation for the optimal cost and strategy. We solve this equation numerically and illustrate optimal strategies for varying risk...
متن کامل